Hat Guessing Games
نویسندگان
چکیده
Hat problems have become a popular topic in recreational mathematics. In a typical hat problem, each of n players tries to guess the color of the hat they are wearing by looking at the colors of the hats worn by some of the other players. In this paper we consider several variants of the problem, united by the common theme that the guessing strategies are required to be deterministic and the objective is to maximize the number of correct answers in the worst case. We also summarize what is currently known about the worst-case analysis of deterministic hat-guessing problems with a finite number of players.
منابع مشابه
A New Variation of Hat Guessing Games
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of n players is assigned a hat from a given color set. Simultaneously, each player tries to guess the color of his/her own hat by looking at colors of hats worn by other players. In this paper, we consider a new variati...
متن کاملFinite dynamical systems, hat games, and coding theory
The dynamical properties of finite dynamical systems (FDSs) have been investigated in the context of coding theoretic problems, such as network coding and index coding, and in the context of hat games, such as the guessing game and Winkler’s hat game. In this paper, we relate the problems mentioned above to properties of FDSs, including the number of fixed points, their stability, and their ins...
متن کاملWinkler's Hat Guessing Game: Better Results for Imbalanced Hat Distributions
In this note, we give an explicit polynomial-time executable strategy for Peter Winkler’s hat guessing game that gives superior results if the distribution of hats is imbalanced. While Winkler’s strategy guarantees in any case that ⌊n/2⌋ of the n player guess their hat color correct, our strategy ensures that the players produce max{r, b} − 1.2n2/3 − 2 correct guesses for any distribution of r ...
متن کاملThe Three Colour Hat Guessing Game on Cycle Graphs
We study a cooperative game in which each member of a team of N players, wearing coloured hats and situated at the vertices of the cycle graph CN , is guessing their own hat colour merely on the basis of observing the hats worn by their two neighbours without exchanging the information. Each hat can have one of three colours. A predetermined guessing strategy is winning if it guarantees at leas...
متن کاملOn Hats and other Covers
We study a game puzzle that has enjoyed recent popularity among mathematicians, computer scientist, coding theorists and even the mass press. In the game, n players are fitted with randomly assigned colored hats. Individual players can see their teammates’ hat colors, but not their own. Based on this information, and without any further communication, each player must attempt to guess his hat c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 22 شماره
صفحات -
تاریخ انتشار 2008